Coloring claw-free graphs with ∆− 1 colors
نویسندگان
چکیده
We prove that every claw-free graph G that does not contain a clique on ∆(G) ≥ 9 vertices can be ∆(G)− 1 colored.
منابع مشابه
ar X iv : 0 71 1 . 28 44 v 1 [ cs . D M ] 1 9 N ov 2 00 7 Dynamic 3 - Coloring of Claw - free Graphs ∗
A dynamic k-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least 2 in G will be adjacent to vertices with at least 2 different colors. The smallest number k for which a graph G can have a dynamic k-coloring is the dynamic chromatic number, denoted by χd(G). In this paper, we investigate the dynamic 3-colorings of claw-free graphs. First, we...
متن کاملDynamic 3-Coloring of Claw-free Graphs
A dynamic k-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least 2 in G will be adjacent to vertices with at least 2 different colors. The smallest number k for which a graph G can have a dynamic k-coloring is the dynamic chromatic number, denoted by χd(G). In this paper, we investigate the dynamic 3-colorings of claw-free graphs. First, we...
متن کاملList-Coloring Claw-Free Graphs with Δ-1 Colors
We prove that if G is a quasi-line graph with ∆(G) > ω(G) and ∆(G) ≥ 69, then χOL(G) ≤ ∆(G) − 1. Together with our previous work, this implies that if G is a claw-free graph with ∆(G) > ω(G) and ∆(G) ≥ 69, then χl(G) ≤ ∆(G)− 1.
متن کاملPlanarization and Acyclic Colorings of Subcubic Claw-Free Graphs
We study methods of planarizing and acyclically coloring claw-free subcubic graphs. We give a polynomial-time algorithm that, given such a graph G, produces an independent set Q of at most n/6 vertices whose removal from G leaves an induced planar subgraph P (in fact, P has treewidth at most four). We further show the stronger result that in polynomial-time a set of at most n/6 edges can be ide...
متن کاملClique-coloring of Ks3, 3-minor free graphs
A clique-coloring of a given graph G is a coloring of the vertices of G such that no maximal clique of size at least two is monocolored. The clique-chromatic number of G is the least number of colors for which G admits a clique-coloring. It has been proved that every planar graph is 3-clique colorable and every claw-free planar graph, different from an odd cycle, is 2-clique colorable. In this ...
متن کامل